Priority queue administration by sublist index
نویسندگان
چکیده
منابع مشابه
A Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملPriority queue classes with priority update
A limitation in the design of the interface of C++ standard priority queues is addressed. The use of priority queues in Dijkstra’s shortest path search algorithm is used as an example. Priority queues are often implemented using heaps. There is a problem, as it may be necessary to change the priority of an element while it is in the queue, but finding the element from within a heap is costly. T...
متن کاملComposite Priority Queue
This paper presents formulas for calculating waiting time for customers in a queue with combined preemptive and head-ofline (nonpreemptive) priority scheduling disciplines and describes the reasoning behind them. This work has been applied in the development of programmable terminal control units. Introduction The development of programmable terminal control units has created the need for a new...
متن کامل2 Priority Queue
In the last lecture, we discussed algorithms for integer sorting. In this lecture we will discuss the relationship between integer sorting algorithms and priority queue data structures. It is obvious that fast priority queues imply fast sorting, since if a priority queue can do Insert and Deletemin in O(f(n)), then we can sort in O(nf(n)) by inserting all elements into the queue then calling De...
متن کاملPriority Queue Operations on EREW-PRAM
Using EREW-PRAM algorithms on a tournament based complete binary tree we implement the insert and extract-min operations with p = log N processors at costs O(1) and O(log log N) respectively. Previous solutions 4, 7] under the PRAM model and identical assumptions attain O(log log N) cost for both operations. We also improve on constant factors the asymptotic bound for extract-min since in it we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1979
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/22.3.220